An Easy-Parallelizable Evolutionary Optimization Algorithm via Probabilistic Bit-Wise Operation for Template Matching
نویسندگان
چکیده
منابع مشابه
Isogeometric Topology Optimization of Continuum Structures using an Evolutionary Algorithm
Topology optimization has been an interesting area of research in recent years. The main focus of this paper is to use an evolutionary swarm intelligence algorithm to perform Isogeometric Topology optimization of continuum structures. A two-dimensional plate is analyzed statically and the nodal displacements are calculated. The nodal displacements using Isogeometric analysis are found to be ...
متن کاملEvaluation of Similarity Measures for Template Matching
Image matching is a critical process in various photogrammetry, computer vision and remote sensing applications such as image registration, 3D model reconstruction, change detection, image fusion, pattern recognition, autonomous navigation, and digital elevation model (DEM) generation and orientation. The primary goal of the image matching process is to establish the correspondence between two ...
متن کاملRow-wise Tiling for the Myers' Bit-Parallel Approximate String Matching Algorithm
Given a text T [1..n] and a pattern P [1..m] the classic dynamic programming algorithm for computing the edit distance between P and every location of T runs in time O(nm). The bit-parallel computation of the dynamic programming matrix [6] runs in time O(n dm/we), where w is the number of bits in computer word. We present a new method that rearranges the bit-parallel computations, achieving tim...
متن کاملA Secure Symmetric Image Encryption Based on Bit-wise Operation
This paper shows a symmetric image encryption based on bit-wise operation (XORing and Shifting). The basic idea is block ciphering (size of each block is 4 bytes) technique to cipher the secret bytes, after that ciphered bytes are again shuffled among N positions (N is the size of secret file). The scheme is combination of substitution as well as transposition techniques which provides addition...
متن کاملAn Algorithm for Efficient and Exhaustive Template Matching
This paper proposes an algorithm for efficient and exhaustive template matching based on the Zero mean Normalized Cross Correlation (ZNCC) function. The algorithm consists in checking at each position a sufficient condition capable of rapidly skipping most of the expensive calculations involved in the evaluation of ZNCC scores at those points that cannot improve the best score found so far. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Japan Society for Precision Engineering
سال: 2019
ISSN: 0912-0289,1882-675X
DOI: 10.2493/jjspe.85.98